A New Algorithm and Refined Bounds for Extended Gcd Computation
نویسندگان
چکیده
Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides reened bounds on the size of the multipliers obtained.
منابع مشابه
Certiied Approximate Univariate Gcds
We study the approximate GCD of two univariate polynomials given with limited accuracy or, equivalently, the exact GCD of the perturbed polynomials within some prescribed tolerance. A perturbed polynomial is regarded as a family of polynomials in a clas-siication space, which leads to an accurate analysis of the computation. Considering only the Sylvester matrix singular values, as is frequentl...
متن کاملOn the Complexity of the Extended Euclidean Algorithm (extended abstract)
Euclid’s algorithm for computing the greatest common divisor of 2 numbers is considered to be the oldest proper algorithm known ([10]). This algorithm can be amplified naturally in various ways. The GCD problem for more than two numbers is interesting in its own right. Thus, we can use Euclid’s algorithm recursively to compute the GCD of more than two numbers. Also, we can do a constructive com...
متن کاملcient Parallel Factorization and Solution ofStructured and Unstructured Linear
This paper gives improved parallel methods for several exact factoriza-tions of some classes of symmetric positive deenite (SPD) matrices. Our factorizations also provide us similarly eecient algorithms for exact computation of the solution of the corresponding linear systems (which need not be SPD), and for nding rank and determinant magnitude. We assume the input matrices have entries that ar...
متن کاملA parallel extended GCD algorithm
A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O (n/ logn) time using at most n1+ processors on CRCW PRAM. Sorenson and Chor and Goldreich both use a modular approach which consider the least significant bits. By contrast, our algorithm only deals with the leading bit...
متن کاملLower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings
We prove lower bounds for the complexity of deciding several relations in imaginary, normEuclidean quadratic integer rings, where computations are assumed to be relative to a basis of piecewise-linear operations. In particular, we establish lower bounds for deciding coprimality in these rings, which yield lower bounds for gcd computations. In each imaginary, norm-Euclidean quadratic integer rin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996